A new branch and bound algorithm for solving complex integer quadratic programs 解复杂二次整数规划问题的新型分枝定界算法
Branch and bound algorithm 分枝界定法
A branch and bound algorithm for solving maximizing a concave function over weakly - efficient 弱有效集上凹函数极大问题的分枝定界算法
Branch and bound algorithm is an important method to be used to acquire the solution of optimal problems 分支定界算法是求解优化问题的重要方法。
4 . the tsp as benchmark shows that this cluster platform can increase the branch and bound algorithm ’ s efficiency and get the optimal solution soon 计算表明,在保证求得最优解的前提下,该平台能很好地提高分支定界算法的效率。